Maximal elements for irreflexive binary relations on compact sets

Characterization of the existence of maximal elements of acyclic relations

We obtain a sufficient condition for the existence of maximal elements of irreflexive binary relations that generalizes the theorem of Bergstrom and Walker by relaxing the compactness condition to a weaker one that is naturally related to the relation. We then prove that the sufficient conditions used both in the Bergstrom-Walker Theorem and in our generalization provide a characterization of t...

Transfer Method for Characterizing the Existence of Maximal Elements of Binary Relations on Compact or Noncompact Sets

Maximal Elements of Weakly Continuous Relations*

A weaker than usual continuity property is defined for binary relations. Relations that have this property, along with certain transitivity properties, are shown to have maximal elements on compact sets. The results cover “interval orders,” the kind of relations that often characterize choice situations in which similar alternatives are indistinguishable. Journal of‘ Economic Literature Classif...

Lattice of full soft Lie algebra

In ‎this ‎paper, ‎we ‎study ‎the ‎relation ‎between ‎the ‎soft ‎sets ‎and ‎soft ‎Lie ‎algebras ‎with ‎the ‎lattice theory. ‎We ‎introduce ‎the ‎concepts ‎of ‎the ‎lattice ‎of ‎soft ‎sets, ‎full ‎soft ‎sets ‎and ‎soft ‎Lie ‎algebras ‎and next, we ‎verify ‎some ‎properties ‎of ‎them. We ‎prove ‎that ‎the ‎lattice ‎of ‎the ‎soft ‎sets ‎on ‎a fixed parameter set is isomorphic to the power set of a ...

Fuzzy number-valued fuzzy ‎relation

It is well known fact that binary relations are generalized mathematical functions. Contrary to functions from domain to range, binary relations may assign to each element of domain two or more elements of range. Some basic operations on functions such as the inverse and composition are applicable to binary relations as well. Depending on the domain or range or both are fuzzy value fuzzy set, i...